AMDS symbol-pair codes from repeated-root cyclic codes
نویسندگان
چکیده
Symbol-pair codes are proposed to guard against pair-errors in symbol-pair read channels. The minimum distance is of significance determining the error-correcting capability a code. One central themes coding theory constructions with largest possible distance. Maximum separable (MDS) and almost maximum (AMDS) optimal sub-optimal regarding Singleton bound, respectively. In this paper, six new classes AMDS explicitly constructed through repeated-root cyclic codes. Remarkably, one class such has unbounded lengths another can reach 13.
منابع مشابه
Repeated-root cyclic codes
In the theory of cyclic codes, it is common practice to require that (n,q)= 1, where n is the word length and Fq is the alphabet. This ensures that the generator g ( x ) of the cyclic code has no multiple zeros ( = repeated mots). Furthermore it makes it possible to use an idempotent element as generator. However, much of the theory also goes through without the restriction on n and q. Recently...
متن کاملB-symbol Distance Distribution of Repeated-root Cyclic Codes
Symbol-pair codes, introduced by Cassuto and Blaum [1], have been raised for symbol-pair read channels. This new idea is motivated by the limitations of the reading process in high-density data storage technologies. Yaakobi et al. [8] introduced codes for b-symbol read channels, where the read operation is performed as a consecutive sequence of b > 2 symbols. In this paper, we come up with a me...
متن کاملThe symbol-pair distance distribution of repeated-root cyclic codes over $\mathbb{F}_{p^m}$
Abstract: Symbol-pair codes are proposed to protect against pair errors in symbol-pair read channels. One of the most important task in symbol-pair coding theory is to determine the minimum pair-distance of symbol-pair codes. In this paper, we investigate the symbol-pair distances of cyclic codes of length p over Fpm . The exact symbol-pair distances of all cyclic codes of such length are deter...
متن کاملOn Repeated-root Cyclic Codes
A parity-check matrix for a q -ary repeated-root cyclic code is derived using the Hasse derivative. Then the min imum distance of a q-ary repeated-root cyclic code C is expressecin terms of the min imum distance of a certain simple-root cyclic code C that is determined by C. With the help of this result, several binary repeated-root cyclic codes of lengths up to n = 62 are shown to contain the ...
متن کاملA note on repeated-root cyclic codes
In papers by Castagnoli et al. and Van Lint, cyclic codeswith repeated roots are analyzed. Both papers fail to acknowledge apreviouswork by Chen, dating back to 1969, which includes an analysisof even, length binary cyclic codes. Results from Chen’s study arepresented. Index Terms -Binary cyclic codes of even length. In [l] and [2], the so called repeated-root cyclic codes h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2023
ISSN: ['1872-681X', '0012-365X']
DOI: https://doi.org/10.1016/j.disc.2023.113391